$L_1$ Rates of Convergence for Linear Rank Statistics
نویسندگان
چکیده
منابع مشابه
Convergence rates for linear
In this work, we examine a finite-dimensional linear inverse problem where the measurements are disturbed by an additive normal noise. The problem is solved both in the frequentist and in the Bayesian frameworks. Convergence of the used methods when the noise tends to zero is studied in the Ky Fan metric. The obtained convergence rate results and parameter choice rules are of a similar structur...
متن کاملEmpirical performance maximization for linear rank statistics
The ROC curve is known to be the golden standard for measuring performance of a test/scoring statistic regarding its capacity of discrimination between two populations in a wide variety of applications, ranging from anomaly detection in signal processing to information retrieval, through medical diagnosis. Most practical performance measures used in scoring applications such as the AUC, the loc...
متن کاملAnd Convergence Rates for Functional Linear Regression
In functional linear regression, the slope “parameter” is a function. Therefore, in a nonparametric context, it is determined by an infinite number of unknowns. Its estimation involves solving an illposed problem and has points of contact with a range of methodologies, including statistical smoothing and deconvolution. The standard approach to estimating the slope function is based explicitly o...
متن کامل$L_1/\ell_1$-to-$L_1/\ell_1$ analysis of linear positive impulsive systems with application to the $L_1/\ell_1$-to-$L_1/\ell_1$ interval observation of linear impulsive and switched systems
Sufficient conditions characterizing the asymptotic stability and the hybrid L1/`1-gain of linear positive impulsive systems under minimum and range dwell-time constraints are obtained. These conditions are stated as infinite-dimensional linear programming problems that can be solved using sum of squares programming, a relaxation that is known to be asymptotically exact in the present case. The...
متن کاملLinear Convergence in the Approximation of Rank-one Convex Envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope f of a given function f : Rn×m → R, i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington. Mathematics Subject Classification. 65K10, 74G15, 74G65, 74N99. Received: May 27...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1976
ISSN: 0090-5364
DOI: 10.1214/aos/1176343549